A Comparison of Several Solvers for Bound Constraint Quadratic Programming within the Context of Frictionless Multibody Dynamics
نویسندگان
چکیده
Many-body dynamics problems are expected to handle millions of unknowns when, for instance, investigating the three-dimensional flow of granular material. Unfortunately, the size of the problems tractable by existing numerical solution techniques is severely limited on convergence grounds. This is typically the case when the equations of motion embed a differential variational inequality (DVI) problem that captures contact and possibly frictional interactions between rigid and/or flexible bodies. As the size of the physical system increases, the speed and/or the quality of the numerical solution decrease. This paper describes three methods the gradient projected minimum residual (GPMINRES) method, the preconditioned spectral projected gradient with fallback (P-SPG-FB) method, and the Kuc̆era method that demonstrate better scalability than the projected Jacobi and Gauss-Seidel methods commonly used to solve contact problems that draw on a DVI-based modeling approach.
منابع مشابه
FGP approach to multi objective quadratic fractional programming problem
Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...
متن کاملScalable Total BETI based solver for 3D multibody frictionless contact problems in mechanical engineering
A Total BETI (TBETI) based domain decomposition algorithm with the preconditioning by a natural coarse grid of the rigid body motions is adapted for the solution of multibody frictionless contact problems of linear elastostatics and proved to be scalable, i.e., the cost of the solution is asymptotically proportional to the number of variables. The analysis admits floating bodies. The proofs com...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملBoundedness of KKT Multipliers in fractional programming problem using convexificators
‎In this paper, using the idea of convexificators, we study boundedness and nonemptiness of Lagrange multipliers satisfying the first order necessary conditions. We consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. Within this context, define generalized Mangasarian-Fromovitz constraint qualification and sh...
متن کاملA Multi-objective Transmission Expansion Planning Strategy: A Bilevel Programming Method
This paper describes a methodology for transmission expansion planning (TEP) within a deregulated electricity market. Two objective functions including investment cost (IC) and congestion cost (CC) are considered. The proposed model forms a bi-level optimization problem in which upper level problem represents an independent system operator (ISO) making its decisions on investment while in the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012